Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources
نویسنده
چکیده
A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryless sequences can be compressed. We propose a linear complexity compressor based on the extended belief propagation, into which an inertia term is heuristically introduced, and show that it has near-optimal performance for moderate block lengths.
منابع مشابه
Lossy Compression in Near-Linear Time via Efficient Random Codebooks and Databases
The compression-complexity trade-off of lossy compression algorithms that are based on a random codebook or a random database is examined. Motivated, in part, by recent results of GuptaVerdú-Weissman (GVW) and their underlying connections with the pattern-matching scheme of Kontoyiannis’ lossy Lempel-Ziv algorithm, we introduce a non-universal version of the lossy LempelZiv method (termed LLZ)....
متن کاملNested convolutional/turbo codes for the binary Wyner-Ziv problem
We show how concatenated (convolutional) codes can be used to compress close to the Wyner-Ziv limit for binary sources. Focusing on the case of lossy compression of an equiprobable memoryless binary source with side information at the decoder, the approach is based on nested binary linear codes, which is the extension of Wyner’s lossless compression scheme to the lossy case proposed by Shamai, ...
متن کاملCompression for Similarity Queries
Traditionally, data compression deals with the problem of concisely representing a data source, e.g. a sequence of letters, for the purpose of eventual reproduction (either exact or approximate). In this work we are interested in the case where the goal is to answer similarity queries about the compressed sequence, i.e. to identify whether or not the original sequence is similar to a given quer...
متن کاملSource coding exponents for zero-delay coding with finite memory
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy source codes are studied. Our main results are the following. For any memoryless source, a suitably designed encoder that time-shares (at most two) memoryless scalar quantizers is as good as any time-varying fixed-rate ZDFM code, in that it can achieve the fastest exponen...
متن کاملAn implementable lossy version of the Lempel-Ziv algorithm - Part I: Optimality for memoryless sources
A new lossy variant of the Fixed-Database Lempel–Ziv coding algorithm for encoding at a fixed distortion level is proposed, and its asymptotic optimality and universality for memoryless sources (with respect to bounded single-letter distortion measures) is demonstrated: As the database size m increases to infinity, the expected compression ratio approaches the rate-distortion function. The comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1107.1609 شماره
صفحات -
تاریخ انتشار 2011